-
1 graph diameter
Математика: диаметр графа -
2 graph diameter
мат. -
3 diameter
диаметр, поперечникdiameter at the top — лесн. диаметр в верхнем отрубе
diameter inside bark — лесн. диаметр в коре
diameter under bark — лесн. диаметр (дерева) без коры
-
4 graph
1) график, диаграммасм. тж. area graph, bar graph, business graphics, diagram, line graph, logarithmic graph, pie graph, ribbon graph, x-y graph2) графматематический объект, представляющий собой конечное множество вершин (node), соединённых рёбрами (edge), или дугами (arc). И тем и другим могут быть сопоставлены атрибуты, а дугам предписаны направления, в этом случае граф называется ориентированным, или орграфомсм. тж. acyclic graph, antisymmetric graph, bigraph, CFG, complete graph, DAG, diameter of graph, directed graph, directed multigraph, disconnected graph, empty graph, graph theory, hypergraph, labeled graph, mixed graph, multigraph, planar graph, random graph, simple circuit, task graph, trivial graphАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > graph
-
5 diameter of graph
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > diameter of graph
-
6 diameter of graph
Большой англо-русский и русско-английский словарь > diameter of graph
-
7 diameter of graph
Математика: диаметр графа -
8 diameter of graph
мат. -
9 диаметр графа
Большой англо-русский и русско-английский словарь > диаметр графа
-
10 extremal
экстремаль, экстремальный extremal [extreme value] distribution ≈ распределение экстремальных значений extremal [extreme] vector ≈ экстремальный вектор extremal [extremum] problem ≈ экстремальная задача extremal probability paper ≈ вероятностная бумага для распределения экстремальных значений extremal with corners ≈ экстремаль с углубленными точками method of extremal metric ≈ метод экстремальной метрики sequence of extremal points ≈ последовательность экстремальных точек - absolute extremal - absolutely extremal - admissible extremal - anormal extremal - broken extremal - canonical extremal - closed extremal - conditional extremal - extremal algebra - extremal basis - extremal characteristic - extremal circle - extremal clique - extremal control - extremal curvature - extremal curve - extremal derivative - extremal diameter - extremal domain - extremal equation - extremal experiment - extremal function - extremal functional - extremal graph - extremal involution - extremal lattice - extremal length - extremal mapping - extremal measure - extremal metric - extremal monomorphism - extremal path - extremal polynomial - extremal quotient - extremal relation - extremal representation - extremal space - extremal spline - extremal statistic - extremal strategy - extremal submanifold - extremal subset - extremal system - extremal transversal - extremal uniformity - global extremal - neighboring extremal - nonsingular extremal - ordinary extremal - parametric extremal - regular extremal - secondary extremal - unconditional extremal (математика) экстремаль, линия экстремумов экстремальный;
крайнийБольшой англо-русский и русско-английский словарь > extremal
-
11 self-conjugate
взаимносопряженный, самосопряженный - not self-conjugate - self-conjugate bundle - self-conjugate circle - self-conjugate cobordisms - self-conjugate coordinates - self-conjugate diameter - self-conjugate element - self-conjugate form - self-conjugate graph - self-conjugate kernel - self-conjugate lines - self-conjugate locus - self-conjugate partition - self-conjugate permutation - self-conjugate plane - self-conjugate point - self-conjugate solution - self-conjugate space - self-conjugate triangleБольшой англо-русский и русско-английский словарь > self-conjugate
-
12 reduction
2) измельчение3) обжатие4) ослабление5) понижение; снижение; уменьшение; редуцирование6) преобразование; изменение7) приведение; упрощение8) метал. раскисление9) метал. коэффициент вытяжки10) сокращение; сужение11) скидка13) горн. процесс отделения металла о руды•reduction ad absurdum — мат. приведение к абсурду; сведение к противоречию ( метод доказательства теоремы)
reduction mod p — мат. редукция по модулю p
reduction per pass — метал. обжатие за проход
reduction to single-domain state — физ. монодоменизация
reduction to unity — мат. приведение к единице
См. также в других словарях:
Diameter — For the notion of diameter in graph theory, see Distance (graph theory). For the computer network protocol, see Diameter (protocol). Diameter In geometry, a diameter of a circle is any straight line segment that passes through the center of the… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… … Wikipedia
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Moore graph — Unsolved problems in mathematics Does a Moore graph with girth 5 and degree 57 exist? In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore … Wikipedia
Distance (graph theory) — Geodesic distance redirects here. For distances on the surface of the Earth, see Great circle distance. In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path connecting… … Wikipedia
Odd graph — The Petersen graph as an odd graph O3 Vertices Edges … Wikipedia
Degree diameter problem — In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
